全文获取类型
收费全文 | 151篇 |
免费 | 57篇 |
国内免费 | 11篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 4篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 5篇 |
2017年 | 13篇 |
2016年 | 12篇 |
2015年 | 9篇 |
2014年 | 19篇 |
2013年 | 14篇 |
2012年 | 14篇 |
2011年 | 13篇 |
2010年 | 7篇 |
2009年 | 12篇 |
2008年 | 10篇 |
2007年 | 15篇 |
2006年 | 9篇 |
2005年 | 7篇 |
2004年 | 5篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1995年 | 2篇 |
1993年 | 1篇 |
1991年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有219条查询结果,搜索用时 15 毫秒
91.
为了弥补部队装备中充电设备技术落后、自动化水平低的缺点,介绍了利用高频开关管IGBT构成模块化充电电源的主电路、控制电路及保护电路的结构、原理。利用该项技术研制的移动式充电车与充电柜,极大地提高了部队的快速反应能力。 相似文献
92.
93.
In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
94.
Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
We consider open‐shop scheduling problems where operation‐processing times are a convex decreasing function of a common limited nonrenewable resource. The scheduler's objective is to determine the optimal job sequence on each machine and the optimal resource allocation for each operation in order to minimize the makespan. We prove that this problem is NP‐hard, but for the special case of the two‐machine problem we provide an efficient optimization algorithm. We also provide a fully polynomial approximation scheme for solving the preemptive case. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
95.
An inventory system that consists of a depot (central warehouse) and retailers (regional warehouses) is considered. The system is replenished regularly on a fixed cycle by an outside supplier. Most of the stock is direct shipped to the retailer locations but some stock is sent to the central warehouse. At the beginning of any one of the periods during the cycle, the central stock can then be completely allocated out to the retailers. In this paper we propose a heuristic method to dynamically (as retailer inventory levels change with time) determine the appropriate period in which to do the allocation. As the optimal method is not tractable, the heuristic's performance is compared against two other approaches. One presets the allocation period, while the other provides a lower bound on the expected shortages of the optimal solution, obtained by assuming that we know ahead of time all of the demands, period by period, in the cycle. The results from extensive simulation experiments show that the dynamic heuristic significantly outperforms the “preset” approach and its performance is reasonably close to the lower bound. Moreover, the logic of the heuristic is appealing and the calculations, associated with using it, are easy to carry out. Sensitivities to various system parameters (such as the safety factor, coefficient of variation of demand, number of regional warehouses, external lead time, and the cycle length) are presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
96.
Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks 下载免费PDF全文
Noam Goldberg 《海军后勤学研究》2017,64(2):139-153
A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017 相似文献
97.
发动机伺服机构故障给新一代运载火箭姿控系统的可靠性和安全性带来挑战,亟须开展重构控制策略研究。针对这一问题,提出一种基于线性规划的摆角重构控制分配方法。将伺服机构故障下的摆角分配问题转化为1范数单目标有约束优化问题,进而转化为标准的线性规划模型,采用单纯形法进行求解。仿真结果表明,所提出的线性规划法能够实现伺服机构故障下姿控系统的完全重构,各摆角均未达到饱和值,表明了方法的有效性。 相似文献
98.
分析了储能线和储能电容脉冲发生器中各种因素对脉冲前沿的影响,比较了二者的优劣,并设计了一种储能线脉冲形成电路。初步的试验表明,该装置能产生脉宽为3~4ns的脉冲。 相似文献
99.
针对并行面向对象数据库的特点,结合异步并行查询执行策略,提出了一种基于对象类的混合式数据放置策略,它包括两个部分:混合式数据划分策略和基于对象类的数据分配策略 相似文献
100.
基于兰彻斯特作战理论,提出了一个新的微分对策模型来研究在交战双方均有信息战系统协助作战的条件下的最优火力分配策略。又运用微分对策理论对该模型进行分析和求解,并对所得到的结论作出符合战术意义的解释。 相似文献